Paul Zimmermann

For the American sportswriter, see Paul Zimmerman. For the Hong Kong politician, see Paul Zimmerman (politician).

Paul Zimmermann is a French computational mathematician, working at INRIA.

His interests include asymptotically-fast arithmetic — he wrote a book [1] on algorithms for computer arithmetic with Richard Brent. He has developed some of the fastest available code for manipulating polynomials over GF(2),[2] and for calculating hypergeometric constants to billions of decimal places.[3] He is presently associated with the CARAMEL project to develop efficient arithmetic, in a general context and in particular in the context of algebraic curves of small genus; arithmetic on polynomials of very large degree turns out to be useful in algorithms for point-counting on such curves.

He has been an active developer of the GMP-ECM implementation of the elliptic curve method for integer factorisation and of MPFR, an arbitrary precision floating point library with correct rounding.

Zimmermann's Erdős number is 2.

References

  1. ^ P. Zimmermann; R.Brent. "Modern Computer Arithmetic". http://www.loria.fr/~zimmerma/mca/pub226.html. 
  2. ^ Paul Zimmermann; Richard P. Brent, Pierrick Gaudry, Emmanuel Thomé (2008). Poorten, Alfred J.; Stein, Andreas. eds. "Faster Multiplication in GF(2)[x"]. Proceedings of ANTS-VIII. Lecture Notes in Computer Science 5011: 153–166. doi:10.1007/978-3-540-79456-1. ISBN 978-3-540-79455-4. http://hal.inria.fr/inria-00188261/en. 
  3. ^ Paul Zimmermann; Howard Cheng, Guillaume Hanrot, Emmanuel Thomé, Eugene Zima (2007). "Time- and Space-Efficient Evaluation of Some Hypergeometric Constants". In C W Brown. Proceedings of International Symposium on Symbolic and Algebraic Computation (ISSAC) 2007. pp. 85–91. 

External links